Classification of some strongly regular subgraphs of the McLaughlin graph

نویسندگان

Jan Degraer

Kris Coolsaet

چکیده

By means of an exhaustive computer search we have proved that the strongly regular graphs with parameters (v, k, λ, μ) = (105, 32, 4, 12), (120, 42, 8, 18) and (176, 70, 18, 34) are unique upto isomorphism. Each of these graphs occurs as an induced subgraph in the strongly regular McLaughlin graph. We have used an orderly backtracking algorithm with look-ahead and look-back strategies, applying constraints based on several combinatorial and algebraic properties of graphs with the given parameters.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CERTAIN TYPES OF EDGE m-POLAR FUZZY GRAPHS

In this research paper, we present a novel frame work for handling $m$-polar information by combining the theory of $m-$polar fuzzy sets with graphs. We introduce certain types of edge regular $m-$polar fuzzy graphs and edge irregular $m-$polar fuzzy graphs. We describe some useful properties of edge regular, strongly edge irregular and strongly edge totally irregular $m-$polar fuzzy graphs. W...

متن کامل

OPTIMAL ANALYSIS OF NON-REGULAR GRAPHS USING THE RESULTS OF REGULAR MODELS VIA AN ITERATIVE METHOD

In this paper an efficient method is developed for the analysis of non-regular graphs which contain regular submodels. A model is called regular if it can be expressed as the product of two or three subgraphs. Efficient decomposition methods are available in the literature for the analysis of some classes of regular models. In the present method, for a non-regular model, first the nodes of th...

متن کامل

Some Induced Subgraphs of Strongly Regular Graphs with no Triangles

Let G be a strongly regular graph with no triangles (SRNT graph) with the parameters (n, k, 0, μ) , if v is a vertex of G, a subgraph which induced by the set of vertices at distance one denoted by G1(v) and subgraph which induced by the set of vertices at distance two denoted by G2(v). In this paper we introduce and study the subgraph which induced by the set U and denoted by G2(U) where, U ca...

متن کامل

Co-cliques and star complements in extremal strongly regular graphs

Suppose that the positive integerμ is the eigenvalue of largest multiplicity in an extremal strongly regular graph G. By interlacing, the independence number of G is at most 4μ2 + 4μ− 2. Star complements are used to show that if this bound is attained then either (a) μ = 1 and G is the Schläfli graph or (b) μ = 2 and G is the McLaughlin graph. © 2006 Elsevier Inc. All rights reserved. AMS class...

متن کامل